Constant approximation for fault-tolerant median problems via iterative rounding

In this paper, we study the fault-tolerant matroid median and knapsack problems. These two problems generalize many fundamental clustering facility location problems, such as uniform k-median, location, median, etc. We present a versatile iterative rounding framework obtain unifying constant-factor approximation algorithm.